Anytime Plan-Adaptation for Continuous Planning
نویسندگان
چکیده
The execution of a plan in a highly dynamic real-world environment entails facing unexpected events that produce discrepancies between the observed and the predicted state. In a situation like this, we need to fix the flaws, and typically we have two possible options: replan from scratch or repair, i.e. adapt the original plan to the new context. This paper presents an effective method to support the decision making between repairing or replanning. Particularly, we have designed a method that estimates the cost of a bridge from the observed state to any reachable goal state in the original plan. We have also endowed this adaptation method with an anytime behaviour to improve the plan quality in terms of both problem metric and stability. The paper also presents some experimental results to evaluate the
منابع مشابه
Anytime heuristic search for partial satisfaction planning
We present a heuristic search approach to solve partial satisfaction planning (PSP) problems. In these problems, goals are modeled as soft constraints with utility values, and actions have costs. Goal utility represents the value of each goal to the user and action cost represents the total resource cost (e.g., time, fuel cost) needed to execute each action. The objective is to find the plan th...
متن کاملA Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the complexity of the domain dynamics, and our planning algorithm can be used to generate policies for any discrete event system that can be simulated. We use the continuous stochastic logic (CSL) as a formalism for expressi...
متن کاملAn UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain an anytime planner that provides partial plans before finding a solution plan, and fu...
متن کاملAnytime Planning for Optimal Tradeoff between Deliberative and Reactive Planning
Anytime algorithms are useful when the time available for computation is limited, that is, when there is a tradec~ between the time cost of further computation and the cost of using a solution that is only partially complete. Although machine planning presents this sort of problem, there has not yet been a treatment of anytime plAn-ing for the general case, that is, a treatment not tied to spec...
متن کاملAPS, a Prolog-Based Anytime Planning System
We introduce Aps (Anytime Planning System), a planner that nds plausible (or approximate) plans quickly and can be interrupted at (almost) any time 5]. The generated plans may depend on unproved default assumptions that can be completely proved as time permits 6]. Aps includes an eecient mechanism to determine (in)consistency of new observations with an already constructed (successful) plan, a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010